Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
نویسندگان
چکیده
منابع مشابه
Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
A fundamental problem arising in many applications in Web science and social network analysis is the problem of identifying all nodes in a network whose PageRank exceeds a given threshold ∆. In this paper, we study the probabilistic version of the problem where given an arbitrary approximation factor c > 1, we are asked to output a set S of nodes such that with high probability, S contains all ...
متن کاملA Sublinear Time Algorithm for PageRank Computations
In a network, identifying all vertices whose PageRank is more than a given threshold value ∆ is a basic problem that has arisen in Web and social network analyses. In this paper, we develop a nearly optimal, sublinear time, randomized algorithm for a close variant of this problem. When given a directed network G = (V,E), a threshold value ∆, and a positive constant c > 3, with probability 1 − o...
متن کاملNonuniform Sampling and Multiscale Computation
We consider multiscale functions of the type that are studied in averaging and homogenization theory and in multiscale modeling. Typical examples are two-scale functions f(x, x/ ), (0 < << 1) that are periodic in the second variable. We prove that under certain band limiting conditions these multiscale functions can be uniquely and stably recovered from non-uniform samples of optimal rate. The ...
متن کاملApproximating PageRank locally with sublinear query complexity
The problem of approximating the PageRank score of a node with minimal information about the rest of the graph has attracted considerable attention in the last decade; but its central question, whether it is in general necessary to explore a non-vanishing fraction of the graph, remained open until now (only for specific graphs and/or nodes was a solution known). We present the first algorithm t...
متن کاملEfficient Computation of PageRank
This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Running-time measurements on various memory configurations are presented for PageRank computation over the 24-million-page Stanford WebBase...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2014
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2013.802752